Selecting cache lists indicating tracks in a cache to process for demotion

ABSTRACT

Provided are a computer program product, system, and method for selecting cache lists indicating tracks in a cache to process for demotion. In response to a selected cache list indicated as stalled as a result of a determination that there are less than a threshold number of unmodified tracks in the selected cache list, the selected cache list is indicated as not stalled in response to determining that the cache lists other than the selected cache list were indicated as not stalled since the selected cache list was last indicated as not stalled. The selected cache list is processed to determine whether there are unmodified tracks in response to indicating the selected cache list as not stalled. The determined unmodified tracks in the selected cache list are processed for demotion from the cache.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a computer program product, system, andmethod for selecting cache lists indicating tracks in a cache to processfor demotion.

2. Description of the Related Art

A cache management system buffers tracks in a storage device recentlyaccessed as a result of read and write operations in a faster accessstorage device, such as memory, than the storage device storing therequested tracks. Subsequent read requests to tracks in the fasteraccess cache memory are returned at a faster rate than returning therequested tracks from the slower access storage, thus reducing readlatency. The cache management system may also return complete to a writerequest when the modified track directed to the storage device iswritten to the cache memory and before the modified track is written outto the storage device, such as a hard disk drive. The write latency tothe storage device is typically significantly longer than the latency towrite to a cache memory. Thus, using cache also reduces write latency.

A cache management system may maintain a linked list having one entryfor each track stored in the cache, which may comprise write databuffered in cache before writing to the storage device or read data. Inthe commonly used Least Recently Used (LRU) cache technique, if a trackin the cache is accessed, i.e., a cache “hit”, then the entry in the LRUlist for the accessed track is moved to a Most Recently Used (MRU) endof the list. If the requested track is not in the cache, i.e., a cachemiss, then the track in the cache whose entry is at the LRU end of thelist may be removed and demoted and an entry for the track data stagedinto cache from the storage is added to the MRU end of the LRU list.With this LRU cache technique, tracks that are more frequently accessedare likely to remain in cache, while data less frequently accessed willmore likely be removed from the LRU end of the list to make room incache for newly accessed tracks.

When processes access a track in the cache, a track identifier of theaccessed cache needs to be moved to the MRU end of the LRU list. To movea track identifier to the MRU end, a lock needs to be obtained on theLRU list. If multiple processes are trying to access the cache, thencontention for the LRU list lock among the multiple processes may delaycache processing. One technique for addressing LRU list lock contentionis to provide multiple LRU lists to indicate cached tracks, so that nowdifferent processors can simultaneously access the different LRU liststo process tracks in the LRU lists.

Of the multiple LRU lists, an Active LRU list may be provided for randomnon-Solid State Drive (SSD) tracks, a Fast LRU list may be provided forrandom SSD tracks, an accelerated LRU list may be provided forsequential tracks, and a demote ready LRU list may be provided forunmodified tracks that are ready to be demoted.

When cache is full, tracks need to be demoted to make room for newlyaccessed tracks. The LRU lists are scanned to determine unmodifiedtracks to move to the demote ready LRU list so they may be demoted.

There is a need in the art for improved techniques for selecting tracksfor demotion from the cache.

SUMMARY

Provided are a computer program product, system, and method forselecting cache lists in a cache to process for demotion. Tracks in thestorage stored in the cache are indicated in a plurality of cache lists.One of the cache lists is indicated as stalled in response to adetermination that there are less than a threshold number of unmodifiedtracks in the cache list. In response to a selected cache list indicatedas stalled, a determination is made as to whether the cache lists otherthan the selected cache list were indicated as not stalled since theselected cache list was last indicated as not stalled. The selectedcache list is indicated as not stalled in response to determining thatthe cache lists other than the selected cache list were indicated as notstalled since the selected cache list was last indicated as not stalled.The selected cache list is processed to determine whether there areunmodified tracks in response to indicating the selected cache list asnot stalled. The determined unmodified tracks in the selected cache listare processed for demotion from the cache.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an embodiment of a computing environment.

FIG. 2 illustrates an embodiment of a Least Recently Used (LRU) list.

FIG. 3 illustrates an embodiment of a cache control block.

FIG. 4 illustrates an embodiment of cache list information.

FIG. 5 illustrates an embodiment of list counters and limits.

FIGS. 6a, 6b, and 6c illustrate an embodiment of operations to processthe cache lists to select tracks for demotion from the cache.

FIG. 7 illustrates a computing environment in which the components ofFIG. 1 may be implemented.

DETAILED DESCRIPTION

In described embodiments, there may be multiple cache lists to indicatetracks in the cache. A cache list may be indicated as stalled if adetermination is made that there are no unmodified tracks. If all thecache lists become stalled, then the cache lists must be processed tochange the stalled state to not stalled to check if the cache lists nowhave unmodified tracks that can be processed for demotion. To ensurethat all cache lists have their state changed from stalled to notstalled so they may be scanned for unmodified tracks, describedembodiments select a cache list and if the cache list is stalleddetermine whether the cache lists other than the selected cache listwere indicated as not stalled since the selected cache list was lastindicated as not stalled. The selected cache list is indicated as notstalled to process in response to determining that the cache lists otherthan the selected cache list were indicated as not stalled since theselected cache list was last indicated as not stalled.

In further embodiments, each of the cache lists may be subdivided intomultiple partition lists having tracks in a particular cache list. Ifall the partition lists become stalled, then the partition lists must beprocessed to change the stalled state to not stalled to check if thepartition lists for a selected cache list now have unmodified tracksthat can be processed for demotion. To ensure that all partition listshave a chance to be indicated as not stalled to process, describedembodiments select a partition list and if stalled indicate the selectedpartition list as not stalled so it may be processed for unmodifiedtracks in response to determining that all the other partition lists forthe selected cache list were indicated as not stalled since the selectedpartition list was last indicated as not stalled.

The described embodiments provide techniques for selecting cache listsand their partition lists for processing for unmodified tracks thatalternates among selecting the lists so that all cache and partitionlists have an opportunity for being processed and are not continuallyoverlooked and not processed for unmodified tracks.

FIG. 1 illustrates an embodiment of a computing environment. A pluralityof hosts 102 a, 102 b . . . 102 n may submit Input/Output (I/O) requeststo a storage controller 104 over a network 106 to access data at volumes108 (e.g., Logical Unit Numbers, Logical Devices, Logical Subsystems,etc.) in a storage 110. The storage controller 104 includes one or moreprocessors 112 and a memory 114, including a cache 116 to cache data forthe storage 110. The processor 112 may comprise a separate centralprocessing unit (CPU), one or a group of multiple cores on a single CPU,or a group of processing resources on one or more CPUs. The cache 116buffers data transferred between the hosts 102 a, 102 b . . . 102 n andthe volumes 108 in the storage 110.

The memory 114 further includes a storage manager 118 for managing thetransfer of tracks transferred between the hosts 102 a, 102 b . . . 102n and the storage 110 and a cache manager 120 that manages datatransferred between the hosts 102 a, 102 b . . . 102 n and the storage110 in the cache 116. A track may comprise any unit of data configuredin the storage 110, such as a track, Logical Block Address (LBA), etc.,which is part of a larger grouping of tracks, such as a volume, logicaldevice, etc.

The cache manager 120 maintains cache management information 122 in thememory 114 to manage read (unmodified) and write (modified) tracks inthe cache 116. The cache management information 122 may include a trackindex 124 providing an index of tracks in the cache 116 to cache controlblocks in a control block directory 300 and a plurality of lists 200 ₁ .. . 200 _(N) providing a temporal ordering of tracks in the cache 116.The control block directory 300 includes the cache control blocks, wherethere is one cache control block for each track in the cache 116providing metadata on the track in the cache 116. The track index 124associates tracks with the cache control blocks providing information onthe tracks in the cache.

In one embodiment, each of the cache lists 200 ₁ . . . 200 _(N) includea plurality of partition lists 220 _(i,1) . . . 220 _(i,M), as shownwith respect to cache list 200 ₁, to provide a further subdivision andtemporal ordering of the tracks in each of the cache lists 200 _(i)based on some attribute of the tracks that are found in the cache lists200 ₁ . . . 200 _(N). Partition lists 220 _(i,1) . . . 220 _(i,M)comprise the lists for cache list 200 _(i). The variables M and Nindicating a total number of partition lists and cache lists, and may bethe same or different. Each cache lists 200 ₁ . . . 200 _(N) may have asame number or different number of partition lists. In one embodiment,the lists 200 ₁ . . . 200 _(N) and 220 ₁ . . . 220 _(M) may compriseLeast Recently Used (LRU) lists. In alternative embodiments, the lists200 may comprise other types of lists to organize indication of tracksin the cache 116.

Each of the partition lists 220 _(i,1) . . . 220 _(i,M) in each of thecache lists 200 _(i) may be associated with a particular attribute of aplurality of attributes associated with tracks in the cache lists 200 ₁. . . 200 _(N). For instance, in one embodiment, the partition lists 220_(i,1) . . . 220 _(i,M) may each be associated with one of theprocessors 112 to provide a processor affinity sub-ordering of tracksindicated in the cache lists 200 ₁ . . . 200 _(N). In alternativeembodiments, the partition lists 220 _(i,1) . . . 220 _(i,M) may beassociated with another attribute of the tracks in the cache lists 200 ₁. . . 200 _(N), such as a type of job, application initiating access tothe track, priority of application accessing the track, etc. Inembodiments where the processor 112 comprises multiple processors andeach partition list 220 _(i,j) is associated with one of the processors112 _(j), such that each of the processors 112 _(j) may independentlyprocess the partition list 220 _(i,j) associated with the processor 112_(i) to process the tracks in the cache indicated in the partition lists220 _(i,j).

In one embodiment the cache lists 200 ₁ . . . 200 _(N) may include anactive list for random non-Solid State Drive (SSD) tracks, a fast listfor random SSD tracks, and an accelerated list for sequential tracks,and a demote ready list 200 _(DR) indicating a plurality of unmodifiedtracks that are ready to be demoted from the cache 116. In alternativeembodiments, the cache lists may be based on other attributes related tothe tracks or the storage 110.

The cache management information 122 further includes cache listinformation 400 providing information on the cache lists 200 ₁ . . . 200_(N) and their partition lists 220 _(i,1) . . . 220 _(i,M). Listcounters and limits 500 are used to determine the status of the cachelists 200 ₁ . . . 200 _(N) and their cache lists 200 ₁ . . . 200 _(N) asdescribed below.

The cache manager 120 periodically scans the cache lists 200 ₁ . . . 200_(N) and their partition lists 220 ₁ . . . 220 _(M) to locate unmodifiedtracks to move to a demote ready list 200 _(DR) from which tracks aredemoted from the cache 116.

The storage manager 118 and cache manager 120 are shown in FIG. 1 asprogram code loaded into the memory 114 and executed by one or more ofthe processors 112. Alternatively, some or all of the functions may beimplemented in hardware devices in the storage controller 104, such asin Application Specific Integrated Circuits (ASICs).

The storage 110 may comprise one or more storage devices known in theart, such as a solid state storage device (SSD) comprised of solid stateelectronics, EEPROM (Electrically Erasable Programmable Read-OnlyMemory), flash memory, flash disk, Random Access Memory (RAM) drive,storage-class memory (SCM), Phase Change Memory (PCM), resistive randomaccess memory (RRAM), spin transfer torque memory (STM-RAM), conductivebridging RAM (CBRAM), magnetic hard disk drive, optical disk, tape, etc.The storage devices may further be configured into an array of devices,such as Just a Bunch of Disks (JBOD), Direct Access Storage Device(DASD), Redundant Array of Independent Disks (RAID) array,virtualization device, etc. Further, the storage devices may compriseheterogeneous storage devices from different vendors or from the samevendor.

The memory 114 may comprise a suitable volatile or non-volatile memorydevices, including those described above.

The network 106 may comprise a Storage Area Network (SAN), a Local AreaNetwork (LAN), a Wide Area Network (WAN), the Internet, and Intranet,etc. Alternatively, the hosts 102 a, 102 b . . . 102 n may connect tothe storage controller 104 over a bus interface, such as a PeripheralComponent Interconnect (PCI) bus interface and other interfaces known inthe art.

FIG. 2 illustrates an embodiment of the lists 200 _(i), 220 _(i,j) asLeast Recently Used (LRU) lists, having a most recently used (MRU) end202 identifying a track most recently added to the cache 116 or mostrecently accessed in the cache 116 and a least recently used (LRU) end204 from which the track identified at the LRU end 204 is selected todemote from the cache 116. The LRU end 204 points to a track identifier,such as a track identifier address or a cache control block index forthe track, of the track that has been in the cache 116 the longest fortracks indicated in that list 200 _(i), 220 _(i,j).

FIG. 3 illustrates an embodiment of an instance of a cache control block300 _(i) for one of the tracks in the cache 116, including, but notlimited to, a cache control block identifier 302, such as an index valueof the cache control block 300 _(i); the LRU list 304, e.g., one of LRUlists 200 _(i), in which the track associated cache control block 300_(i) is indicated; a track data type 306, such as unmodifiedsequentially accessed track, unmodified non-sequentially accessed track,etc.; a cache timestamp 308 indicating a time the track was added to thecache 116; and a demote status 310 indicating whether the trackidentified by the cache control block 300 _(i) is to be demoted from thecache 116.

In certain embodiments, the cache timestamp 308 may be set to a sequencenumber that that is periodically incremented, such as at every clockcycle or couple of milliseconds. When the track is added to the cache116, the timestamp 308 is set to the current value for the sequencenumber.

FIG. 4 illustrates an embodiment of cache list information 400 _(i),maintained for one of the cache lists 200 ₁ . . . 200 _(N) to providemetadata on cache list 200 _(i), including, but not limited to, a cachelist identifier (ID) 402; a cache list stall indicator 404 indicatingwhether the cache list 402 is in a stalled state, which means that thecache list 402 was previously determined to have less than a thresholdnumber of (or zero) unmodified tracks; and partition list informationindicating for each partition list 406 _(i,1) . . . 406 _(i,M) in cachelist 200 _(i) (field 402) a partition list stall indicator 408 _(i,1) .. . 408 _(i,M), respectively, indicating whether the correspondingpartition list 406 _(i,1) . . . 406 _(i,M) is in a stalled or not staledstate, wherein the stalled state occurs if a determination was recentlymade that the partition list has no unmodified tracks. A not stalledstate occurs if the indicators 404, 408 _(i,1) . . . 408 _(i,N) are setto indicate not stalled from a stalled state.

FIG. 5 illustrates an embodiment of list counters and limits 500 used todetermine when to reset the cache list 404 and partition list 406 _(i,j)stall indicators to the not stalled state so that those lists may beprocessed. A cache list stall reset limit 502 may be set to an oddnumber greater than the number N of cache lists 200 ₁ . . . 200 _(N),and a cache list stall counter 504 keeps tracks of a number of times thecache lists 200 ₁ . . . 200 _(N) were determined to be in a stalledstate, i.e., its stall indicator 404 _(i) indicates stalled, whenprocessed for unmodified tracks. A partition list stall reset limit 506may be set to an odd number greater than an Mth triangular number, wereM is the number of partition lists 220 _(i,1) . . . 220 _(i,M), i.e.,the sum of all integers from 1 through M. Partition list counters 508 ₁. . . 508 _(N) indicate a number of times the partition lists 220 _(i,j)for cache lists 200 ₁ . . . 200 _(N), respectively, were in a stalledstate, i.e., their partition list stall indicator 408 _(i,j) indicatedstalled, when processed for unmodified tracks.

FIGS. 6a, 6b, and 6c illustrate an embodiment of operations performed bythe cache manager 120 to process the cache lists 200 ₁ . . . 200 _(N)and their partition lists 220 _(i,1) . . . 220 _(i,M) to determineunmodified tracks to process for demotion from the cache 116, which mayinvolve demoting the determined unmodified tracks or moving them to thedemote ready list 200 _(DR), from which tracks are demoted from thecache 116. The cache manager 120 may periodically perform the operationsof FIGS. 6a, 6b, 6c to locate unmodified tracks to demote to free spacein the cache 116 or perform the operations in response to an event, suchas the cache 116 reaching a certain full threshold. Upon initiating (atblock 600) the operation to scan the cache lists 200 ₁ . . . 200 _(N) tolocate unmodified tracks to demote, the cache manager 120 selects (atblock 602) one of the cache lists 200 ₁ . . . 200 _(N). In oneembodiment, one of the cache lists 200 ₁ . . . 200 _(N) may be selectedto maximize the cache hit ratio among the cache lists 200 ₁ . . . 200_(N), such as by selecting the cache list 200 _(i) having a highestcache hit rate, or based on some other criteria. If (at block 604) theselected cache list 200 _(i) is stalled, e.g., its cache list stallindicator 404 _(i) indicates stalled, then the cache list stall counter504 is incremented (at block 606) and a determination is made (at block608) as to whether the cache lists 200 ₁ . . . 200 _(N) other than theselected cache list 200 _(i) have been indicated as not stalled sincethe selected cache list 200 _(i) was last indicated as not stalled,where indication may be made by setting the cache list stall indicator404 for cache list 200 _(i) to indicate not stalled.

In one embodiment, the determination at block 608 may be performed bydetermining whether the cache list stall counter 504 modulo the cachelist stall reset limit 502 is zero. A modulo or remainder value of zeroindicates that the cache lists 200 ₁ . . . 200 _(N), other than theselected cache list 200 _(i) had their cache list stall indicator 404reset to indicate “not stalled” since the cache list stall indicator 404of the selected cache list 200 _(i) was last set to indicate as “notstalled”. This operation ensures that each of cache lists 200 ₁ . . .200 _(N) will have an opportunity to be set to “not stalled” and scannedfor unmodified tracks before another cache list 200 _(i) isreconsidered. This avoids certain lists from being continually bypassedand left in the stalled state.

If (at block 608) all the cache lists 200 ₁ . . . 200 _(N) werepreviously indicated as not stalled from the stalled state since theselected cache list 200 _(i) was last indicated as stalled, then theselected cache list 200 _(i) is indicated (at block 610) as not stalled,e.g., its cache list stall indicator 404 is reset to not stalled, andthe cache list stall counter 504 is reset (at block 612) to zero.

If (at block 608) all the cache lists 200 ₁ . . . 200 _(N) other thanthe selected cache list 200 i were not previously indicated as notstalled from the stalled state since the selected cache list 200 _(i)was last indicated as stalled, then control proceeds back to block 602to select a another cache list to process.

If (at block 604) the selected cache list 200 _(i) is indicated as notstalled or after resetting the cache list stall indicator 404 toindicate not stalled (from block 612), control proceeds (at block 614)to block 616 in FIG. 6b to process the selected cache list 200 _(i) thatis not in the stalled state to determine whether there are unmodifiedtracks to demote.

With respect to FIG. 6b , the cache manager 120 selects (at block 616)one of the partition lists 220 _(i,1) . . . 220 _(i,M) for selectedcache list 200 _(i). The selection at block 616 may be based on acriteria, such as the partition lists 220 _(i,1) . . . 220 _(i,M) havinga lowest timestamp. If (at block 618) the selected partition list 220_(i,j) is stalled (e.g., the partition list stall indicator 408 _(i,j)for partition list 200 _(i,j) indicates stalled), then the partitionlist stall counter 508 _(i) for the selected cache list 200 _(i) isincremented (at block 620).

At block 622, a determination is made as to whether all the partitionlists 220 _(i,1) . . . 220 _(i,M) other than the selected partition list200 _(i,j) for the selected cache list 200 _(i) are indicated as notstalled since the selected partition list 220 _(i,j) was last indicatedas not stalled, e.g., its partition list stall indicator 408 _(i,j) wasreset to indicate not stalled. In one embodiment, the determination atblock 622 may be performed by determining whether the partition liststall counter 508 _(i) (for the selected cache list 200 _(i)) modulo thepartition list stall reset limit 506 is zero. A modulo or remaindervalue of zero indicates that the partition lists 220 _(i,1) . . . 220_(i,M) for cache list 200 _(i) other than the selected partition list220 _(i,k) had their partition list stall indicator 408 _(i,k) reset toindicate “not stalled” since the partition list stall indicator 408_(i,j) of the selected partition list 220 _(i,j) was last indicated as“not stalled”. This operation insures that each of the partition lists220 ₁ . . . 220 _(M) will have an opportunity to be set to “not stalled”and scanned for unmodified tracks before another partition list 220_(i,j) is reconsidered. This avoids certain partition lists from beingcontinually bypassed and left in the stalled state.

If (at block 622) not all the other partition lists 220 _(i,1) . . . 220_(i,M) had a chance to be reset to not stalled and considered since thepartition list 220 _(i,j) was last processed, then the cache manager 120determines (at block 624) whether all the partition lists 220 _(i,1) . .. 220 _(i,M) for the selected cache list 200 _(i) were considered duringthe consideration of the selected cache list 200 _(i) and if so, whether(at block 626) all the considered partition lists 220 _(i,1) . . . 220_(i,M) were determined to be stalled. If (at block 626) all theconsidered partition lists 220 _(i,1) . . . 220 _(i,M) were consideredand stalled and the selected partition list 220 _(i,j) not indicated asnot stalled, then the cache manager 120 indicates (at block 628) thatthe selected cache list 200 _(i) is stalled, such as by indicatingstalled in the cache list stall indicator 404 for the selected cachelist 200 _(i). From block 628 or if (from the no branch of block 626)not all the partition lists 220 _(i,1) . . . 220 _(i,M) were determinedto be stalled, then control proceeds (at block 630) back to block 602 inFIG. 6a to select a next cache list 200 _(i) to consider for determiningunmodified tracks.

If (at block 624) not all the partition lists 220 _(i,1) . . . 220_(i,M) were considered, then the cache manager 120 selects (at block632) another partition list 220 _(i), such as one having a next lowesttimestamp and control proceeds to block 618 to consider that nextselected partition list 220 _(i).

If (at block 618) the selected partition list 200 _(i,j) is not stalled,e.g., the partition list stall indicator 408 _(i,j) indicates notstalled or after indicating the selected partition list 200 _(i,j), asnot stalled (at blocks 634 and 636), then control proceeds (at block638) to block 640 in FIG. 6c where the cache manager 120 determines (atblock 640) whether the selected partition list 200 _(i,j) includesunmodified tracks. If so, the unmodified tracks are processed (at block642) for demotion, such as by adding to the demote ready list 200 _(RD)or by demoting. If (at block 640) there are no unmodified tracks in theselected partition list 200 _(i,j), then the selected partition list 200_(i,j) is indicated as stalled, i.e., the partition list stall indicator408 _(i,j) is set to indicate stalled. From block 644 if the selectedpartition list 200 _(i,j) is stalled or after the unmodified tracks areprocessed for demotion (from block 642), control proceeds (at block 646)back to block 616 in FIG. 6b to select another one of the partitionlists 220 _(i,1) . . . 220 _(i,M) not yet considered, such as one havinga next lowest timestamp, to further process for unmodified tracks.

Described embodiments provide techniques for managing multiple cachelists and rotating among indicating a stalled cache list as not stalledto process so that all cache lists have their status changed to notstalled so they are processed for unmodified tracks. Further, describedembodiments allow for the cache lists to each be further subdivided intopartition lists and processing the partition lists so that stalledpartitions may have their status changed to not stalled so they can beprocessed.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Java, Smalltalk, C++ or the like,and conventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The computational components of FIG. 1, including the hosts 102 a, 102 b. . . 102 n and storage controller 104, may be implemented in one ormore computer systems, such as the computer system 702 shown in FIG. 7.Computer system/server 702 may be described in the general context ofcomputer system executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 702 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 7, the computer system/server 702 is shown in the formof a general-purpose computing device. The components of computersystem/server 702 may include, but are not limited to, one or moreprocessors or processing units 704, a system memory 706, and a bus 708that couples various system components including system memory 706 toprocessor 704. Bus 708 represents one or more of any of several types ofbus structures, including a memory bus or memory controller, aperipheral bus, an accelerated graphics port, and a processor or localbus using any of a variety of bus architectures. By way of example, andnot limitation, such architectures include Industry StandardArchitecture (ISA) bus, Micro Channel Architecture (MCA) bus, EnhancedISA (EISA) bus, Video Electronics Standards Association (VESA) localbus, and Peripheral Component Interconnects (PCI) bus.

Computer system/server 702 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 702, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 706 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 710 and/or cachememory 712. Computer system/server 702 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 713 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 708 by one or more datamedia interfaces. As will be further depicted and described below,memory 706 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 714, having a set (at least one) of program modules 716,may be stored in memory 706 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. The components of the computer 702 may be implemented asprogram modules 716 which generally carry out the functions and/ormethodologies of embodiments of the invention as described herein. Thesystems of FIG. 1 may be implemented in one or more computer systems702, where if they are implemented in multiple computer systems 702,then the computer systems may communicate over a network.

Computer system/server 702 may also communicate with one or moreexternal devices 718 such as a keyboard, a pointing device, a display720, etc.; one or more devices that enable a user to interact withcomputer system/server 702; and/or any devices (e.g., network card,modem, etc.) that enable computer system/server 702 to communicate withone or more other computing devices. Such communication can occur viaInput/Output (I/O) interfaces 722. Still yet, computer system/server 702can communicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 724. As depicted, network adapter 724communicates with the other components of computer system/server 702 viabus 708. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 702. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, and “one embodiment” mean “one or more (but not all)embodiments of the present invention(s)” unless expressly specifiedotherwise.

The terms “including”, “comprising”, “having” and variations thereofmean “including but not limited to”, unless expressly specifiedotherwise.

The enumerated listing of items does not imply that any or all of theitems are mutually exclusive, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

Devices that are in communication with each other need not be incontinuous communication with each other, unless expressly specifiedotherwise. In addition, devices that are in communication with eachother may communicate directly or indirectly through one or moreintermediaries.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary a variety of optional components are described toillustrate the wide variety of possible embodiments of the presentinvention.

When a single device or article is described herein, it will be readilyapparent that more than one device/article (whether or not theycooperate) may be used in place of a single device/article. Similarly,where more than one device or article is described herein (whether ornot they cooperate), it will be readily apparent that a singledevice/article may be used in place of the more than one device orarticle or a different number of devices/articles may be used instead ofthe shown number of devices or programs. The functionality and/or thefeatures of a device may be alternatively embodied by one or more otherdevices which are not explicitly described as having suchfunctionality/features. Thus, other embodiments of the present inventionneed not include the device itself.

The foregoing description of various embodiments of the invention hasbeen presented for the purposes of illustration and description. It isnot intended to be exhaustive or to limit the invention to the preciseform disclosed. Many modifications and variations are possible in lightof the above teaching. It is intended that the scope of the invention belimited not by this detailed description, but rather by the claimsappended hereto. The above specification, examples and data provide acomplete description of the manufacture and use of the composition ofthe invention. Since many embodiments of the invention can be madewithout departing from the spirit and scope of the invention, theinvention resides in the claims herein after appended.

What is claimed is:
 1. A computer program product for managing tracks ina storage in a cache, the computer program product comprising a computerreadable storage medium having computer readable program code embodiedtherein that when executed performs operations, the operationscomprising: determining a cache list of a plurality of cache listshaving less than a threshold number of unmodified tracks; determiningwhether other cache lists of the cache lists other than the determinedcache list have been scanned for unmodified tracks since the determinedcache list was scanned; processing the determined cache list todetermine whether there are unmodified tracks in response to determiningthat the other cache lists have been scanned for unmodified tracks; andprocessing the unmodified tracks in the determined cache list fordemotion from the cache.
 2. The computer program product of claim 1,wherein the operations further comprise: selecting one of the othercache lists to process for unmodified tracks in response to determiningthat other cache lists have not been scanned for unmodified tracks sincethe determined cache list was scanned for unmodified tracks.
 3. Thecomputer program product of claim 2, wherein the operations furthercomprise: performing for the selected cache list another iteration ofthe determining whether other cache lists other than the determinedcache list comprising the selected cache list have been scanned forunmodified tracks, the processing the determined cache list to determinewhether there are unmodified tracks, and the processing the unmodifiedtracks in the determined cache list for demotion from the cache.
 4. Thecomputer program product of claim 1, wherein each of the cache listsincludes a plurality of partition lists, wherein the processing thedetermined cache list to determine whether there are unmodified trackscomprises: selecting a partition list of the partition lists for thedetermined cache list; determining whether other partition lists for thedetermined cache list other than the determined partition list have beenscanned for unmodified tracks since the selected partition list wasscanned; processing the selected partition list to determine whetherthere are unmodified tracks in response to determining that the otherpartition lists for the determined cache list have been scanned forunmodified tracks; and processing the unmodified tracks in the selectedpartition list for demotion from the cache.
 5. The computer programproduct of claim 4, wherein the operations further comprise: selectinganother one of the other partition lists to process for unmodifiedtracks in response to determining that other partition lists have notbeen scanned for unmodified tracks since the selected partition list wasscanned for unmodified tracks.
 6. The computer program product of claim5, wherein the operations further comprise: further performing for theselected another one of the partition lists another iteration of thedetermining whether other partition lists for the determined cache listother than the selected another one of the partition lists have beenscanned for unmodified tracks since the selected partition list wasscanned, processing the selected another one of the partition lists todetermine whether there are unmodified tracks in response to determiningthat each of the other partition lists for the determined cache listother than the selected another one of the partition lists have beenscanned for unmodified tracks; and processing the unmodified tracks inthe processed selected another one of the partition lists for demotionfrom the cache.
 7. The computer program product of claim 5, wherein theoperations further comprise: after processing each of the partitionlists for the determined cache list, selecting a cache list; andperforming for the selected cache list another iteration of thedetermining whether other cache lists other than the determined cachelist comprising the selected cache list have been scanned for unmodifiedtracks, the processing the determined cache list to determine whetherthere are unmodified tracks, and the processing the unmodified tracks inthe determined cache list for demotion from the cache.
 8. The computerprogram product of claim 7, wherein the selected cache list is selectedto maximize cache hits among the cache lists, and wherein the selectedpartition list has a track with a next lowest timestamp among the tracksin the partition lists other than a last considered selected partitionlist.
 9. The computer program product of claim 7, wherein the cachelists include an active list for random non-Solid State Drive (SSD)tracks, a fast list for random SSD tracks, and an accelerated list forsequential tracks, wherein each of the partition lists in each of thecache lists are used to indicate tracks having an attribute of aplurality of attributes associated with tracks in the cache lists.
 10. Asystem in communication with a storage having tracks, comprising: aprocessor; a cache; a computer readable storage medium having programcode that in response to execution by the processor performs operations,the operations comprising: determining a cache list of a plurality ofcache lists having less than a threshold number of unmodified tracks;determining whether other cache lists of the cache lists other than thedetermined cache list have been scanned for unmodified tracks since thedetermined cache list was scanned; processing the determined cache listto determine whether there are unmodified tracks in response todetermining that the other cache lists have been scanned for unmodifiedtracks; and processing the unmodified tracks in the determined cachelist for demotion from the cache.
 11. The system of claim 10, whereinthe operations further comprise: selecting one of the other cache liststo process for unmodified tracks in response to determining that othercache lists have not been scanned for unmodified tracks since thedetermined cache list was scanned for unmodified tracks.
 12. The systemof claim 11, wherein the operations further comprise: performing for theselected cache list another iteration of the determining whether othercache lists other than the determined cache list comprising the selectedcache list have been scanned for unmodified tracks, the processing thedetermined cache list to determine whether there are unmodified tracks,and the processing the unmodified tracks in the determined cache listfor demotion from the cache.
 13. The system of claim 10, wherein each ofthe cache lists includes a plurality of partition lists, wherein theprocessing the determined cache list to determine whether there areunmodified tracks comprises: selecting a partition list of the partitionlists for the determined cache list; determining whether other partitionlists for the determined cache list other than the determined partitionlist have been scanned for unmodified tracks since the selectedpartition list was scanned; processing the selected partition list todetermine whether there are unmodified tracks in response to determiningthat each of the other partition lists for the determined cache listhave been scanned for unmodified tracks; and processing the unmodifiedtracks in the processed selected partition list for demotion from thecache.
 14. The system of claim 13, wherein the operations furthercomprise: selecting another one of the other partition lists to processfor unmodified tracks in response to determining that other partitionlists have not been scanned for unmodified tracks since the selectedpartition list was scanned for unmodified tracks.
 15. The system ofclaim 14, wherein the operations further comprise: further performingfor the selected another one of the partition lists another iteration ofthe determining whether other partition lists for the determined cachelist other than the selected another one of the partition lists havebeen scanned for unmodified tracks since the selected partition list wasscanned, processing the selected another one of the partition lists todetermine whether there are unmodified tracks in response to determiningthat each of the partition lists for the determined cache list otherthan the selected another one of the partition lists have been scannedfor unmodified tracks; and processing the unmodified tracks in theprocessed selected another one of the partition lists for demotion fromthe cache.
 16. The system of claim 14, wherein the operations furthercomprise: after processing each of the partition lists for thedetermined cache list, selecting a cache list; and performing for theselected cache list another iteration of the determining whether othercache lists other than the determined cache list comprising the selectedcache list have been scanned for unmodified tracks, the processing thedetermined cache list to determine whether there are unmodified tracks,and the processing the unmodified tracks in the determined cache listfor demotion from the cache.
 17. A method for managing tracks in astorage in a cache, comprising: determining a cache list of a pluralityof cache lists having less than a threshold number of unmodified tracks;determining whether each of other cache lists of the cache lists otherthan the determined cache first have been scanned for unmodified trackssince the determined cache list was scanned; processing the determinedcache list to determine whether there are unmodified tracks in responseto determining that each of the other cache fists have been scanned forunmodified tracks; and processing the unmodified tracks in thedetermined cache list for demotion from the cache.
 18. The method ofclaim 17, further comprising: selecting one of the other cache lists toprocess for unmodified tracks in response to determining that each ofthe other cache lists have not been scanned for unmodified tracks sincethe determined cache list was scanned for unmodified tracks.
 19. Themethod of claim 18, further comprising: performing for the selectedcache list another iteration of the determining whether each of theother cache lists other than the determined cache list comprising theselected cache list have been scanned for unmodified tracks, theprocessing the determined cache list to determine whether there areunmodified tracks, and the processing the unmodified tracks in thedetermined cache list for demotion from the cache.
 20. The method ofclaim 17, wherein each of the cache lists includes a plurality ofpartition lists, wherein the processing the determined cache list todetermine whether there are unmodified tracks comprises: selecting apartition list of the partition lists for the determined cache list;determining whether other partition lists for the determined cache listother than the determined partition list have been scanned forunmodified tracks since the selected partition list was scanned;processing the selected partition list to determine whether there areunmodified tracks in response to determining that the other partitionlists for the determined cache list have been scanned for unmodifiedtracks; and processing the unmodified tracks in the selected partitionlist for demotion from the cache.
 21. The method of claim 20, furthercomprising: selecting another one of the other partition lists toprocess for unmodified tracks in response to determining that otherpartition lists have not been scanned for unmodified tracks since theselected partition list was scanned for unmodified tracks.
 22. Themethod of claim 21, further comprising: further performing for theselected another one of the partition lists another iteration of thedetermining whether each of the partition lists for the determined cachelist other than the selected another one of the partition lists havebeen scanned for unmodified tracks since the selected partition list wasscanned, processing the selected another one of the partition lists todetermine whether there are unmodified tracks in response to determiningthat each of the partition lists for the determined cache list otherthan the selected another one of the partition lists have been scannedfor unmodified tracks; and processing the unmodified tracks in theprocessed selected another one of the partition lists for demotion fromthe cache.
 23. The method of claim 21, further comprising: afterprocessing each of the partition lists for the determined cache list,selecting a cache list; and performing for the selected cache listanother iteration of the determining whether each of the other cachelists other than the determined cache list comprising the selected cachelist have been scanned for unmodified tracks, the processing thedetermined cache list to determine whether there are unmodified tracks,the processing the unmodified tracks in the determined cache list fordemotion from the cache.